Further Improvement on Maximum Independent Set in Degree-4 Graphs
نویسندگان
چکیده
We present a simple algorithm for the maximum independent set problem in an n-vertex graph with degree bounded by 4, which runs in O∗(1.1455n) time and improves all previous algorithms for this problem. In this paper, we use the “Measure and Conquer method” to analyze the running time bound, and use some good reduction and branching rules with a new idea on setting weights to obtain the improved time bound.
منابع مشابه
Further Improvement on Maximum Independent Set in Graphs with Maximum Degree 4
We present a simple algorithm for the maximum independent set problem in an n-vertex graph with degree bounded by 4, which runs in O∗(1.1446n) time and improves all previous algorithms for this problem. The algorithm is analyzed by using the “Measure and Conquer” method. We use some good reduction and branching rules with a new idea on setting weights to obtain the improved time bound without i...
متن کاملA refined algorithm for maximum independent set in degree-4 graphs
The maximum independent set problem is one of the most important problems in worstcase analysis for exact algorithms. Improvement on this problem in low-degree graphs can be used to get improvement on the problem in general graphs. In this paper, we show that the maximum independent set problem in an n-vertex graph with degree bounded by 4 can be solved in O∗(1.1376n) time and polynomial space,...
متن کاملFast Algorithms for Max Independent Set in Graphs of Small Average Degree
max independent set is a paradigmatic problem in theoretical computer science and numerous studies tackle its resolution by exact algorithms with non-trivial worst-case complexity. The best such complexity is, to our knowledge, the O(1.1889) algorithm claimed by (J. M. Robson, Finding a maximum independent set in time O(2), Technical Report 1251-01, LaBRI, Université de Bordeaux I, 2001) in his...
متن کاملOn reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملMaximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537n){\mathcal O}(1.08537^n)
We show that Maximum Independent Set on connected graphs of average degree at most three can be solved in O(1.08537) time and linear space. This improves previous results on graphs of maximum degree three, as our connectivity requirement only functions to ensure that each connected component has average degree at most three. We link this result to exact algorithms of Maximum Independent Set on ...
متن کامل